Fast DCT-I, DCT-III, and DCT-IV via Moments
نویسندگان
چکیده
منابع مشابه
Fast DCT-I, DCT-III, and DCT-IV via Moments
This paper presents a novel approach to compute DCT-I, DCT-III, and DCT-IV. By using a modular mapping and truncating, DCTs are approximated by linear sums of discrete moments computed fast only through additions. This enables us to use computational techniques developed for computing moments to compute DCTs efficiently. We demonstrate this by applying our earlier systolic solution to this prob...
متن کاملFast DCT domain filtering using the DCT and the DST
A method for efficient spatial domain filtering, directly in the discrete cosine transform (DCT) domain, is developed and proposed. It consists of using the discrete sine transform (DST) and the DCT for transform-domain processing on the in JPEG basis of the previously derived convolution-multiplication properties of discrete trigonometric transforms. The proposed scheme requires neither zero p...
متن کاملAssociative architecture for fast DCT
This paper discusses an associative processor architecture designed to meet the demands of real-time image processing applications. In a single chip, this architecture provides thousands of processors one for each pixel, in the form of associative memory. This paper focuses on a generic, proprietary associative processor architecture and discusses implcmcnting the discrete cosine transform (DCT...
متن کاملDirect Conversions Between DV Format DCT and Ordinary DCT
digital recording, DVC format, 8-8 DCT, 2-4-8 DCT A fast algorithm is developed for direct conversions between the 2-4-8 DCT mode associated with the digital video cassette (DVC) standard and the ordinary 8-8 DCT associated with other formats of compressed video. The algorithm avoids explicit transformations to and from the original pixel domain and thus saves a considerable amount of computati...
متن کاملFast Approximate Dct : Basic { Idea , Error Analysis
The discrete cosine transform (DCT) has a variety of applications in image and speech processing. The idea of the subband{DFT (SB{DFT) [1], [2] is applied in [3] to the DCT. In this paper the basic idea of the SB{DCT is discussed which is based on subband decomposition of the input sequence. Approximation is done by discarding the computations of bands of little energy. The complexity of this f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2005
ISSN: 1687-6180
DOI: 10.1155/asp.2005.1902